Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
and(x, or(y, z)) → or(and(x, y), and(x, z))
and(x, and(y, y)) → and(x, y)
or(or(x, y), and(y, z)) → or(x, y)
or(x, and(x, y)) → x
or(true, y) → true
or(x, false) → x
or(x, x) → x
or(x, or(y, y)) → or(x, y)
and(x, true) → x
and(false, y) → false
and(x, x) → x
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
and(x, or(y, z)) → or(and(x, y), and(x, z))
and(x, and(y, y)) → and(x, y)
or(or(x, y), and(y, z)) → or(x, y)
or(x, and(x, y)) → x
or(true, y) → true
or(x, false) → x
or(x, x) → x
or(x, or(y, y)) → or(x, y)
and(x, true) → x
and(false, y) → false
and(x, x) → x
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence:
[and2, false] > or2
Status: true: multiset
and2: [2,1]
false: multiset
or2: [2,1]